Fast binary CT using Fourier null space regularization (FNSR)

Fast Fourier single-pixel imaging using binary illumination

Fourier single-pixel imaging (FSI) has proven capable of reconstructing highquality two-dimensional and three-dimensional images. The utilization of the sparsity of natural images in Fourier domain allows high-resolution images to be reconstructed from far fewer measurements than effective image pixels. However, applying original FSI in digital micro-mirror device (DMD) based high-speed imaging...

Fast Protein Superfamily Classification Using Principal Component Null Space Analysis

The protein family classification problem, which consists of determining the family memberships of given unknown protein sequences, is very important for a biologist for many practical reasons, such as drug discovery, prediction of molecular functions and medical diagnosis. Neural networks and bayesian methods have performed well on the protein classification problem, achieving accuracy ranging...

Ration-space Obstacles Using the Fast Fourier Transform

This paper presents a new method for computing the connguration-space map of obstacles that is used in motion-planning algorithms. The method derives from the observation that, when the robot is a rigid object that can only translate, the connguration space is a convolution of the workspace and the robot. This convolution is computed with the use of the Fast Fourier Transform (FFT) algorithm. T...

Computation of Configuration-Space Obstacles Using the Fast Fourier Transform

Computation of Configuration-Space Obstacles Using the Fast Fourier Tkansform

Thh paper presents a new method for computing the configuration-space map of obstacles that is used in motion-planning algorithms. The method derives from the observation that, when the robot is a rigid object that can only translate, the configuration space is a convolution of the workspace and the robot. This convolution is computed with the use of the Fast Fourier Transform (FFT) algorithm. ...